Moni Naor

Results: 60



#Item
21On Robust Combiners for Oblivious Transfer and other Primitives Danny Harnik∗ Joe Kilian†  Moni Naor∗

On Robust Combiners for Oblivious Transfer and other Primitives Danny Harnik∗ Joe Kilian† Moni Naor∗

Add to Reading List

Source URL: omereingold.files.wordpress.com

Language: English - Date: 2014-10-22 02:11:05
    22Distributed Pseudo-Random Functions and KDCs Moni Naor? Benny Pinkas?? Omer Reingold??? Dept. of Computer Science and Applied Math Weizmann Institute of Science Rehovot, Israel

    Distributed Pseudo-Random Functions and KDCs Moni Naor? Benny Pinkas?? Omer Reingold??? Dept. of Computer Science and Applied Math Weizmann Institute of Science Rehovot, Israel

    Add to Reading List

    Source URL: omereingold.files.wordpress.com

    Language: English - Date: 2014-10-21 19:12:21
      23Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions  Moni Naor y Omer Reingold z

      Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions  Moni Naor y Omer Reingold z

      Add to Reading List

      Source URL: omereingold.files.wordpress.com

      Language: English - Date: 2014-10-20 23:44:32
        24Constru
ting Pseudo-Random Permutations with a Pres
ribed Stru
ture Moni Naor  Omer Reingoldy

        Constru ting Pseudo-Random Permutations with a Pres ribed Stru ture Moni Naor Omer Reingoldy

        Add to Reading List

        Source URL: omereingold.files.wordpress.com

        Language: English - Date: 2014-10-22 00:23:07
          25A Pseudo-Random Encryption Mode Moni Naor ∗  Omer Reingold

          A Pseudo-Random Encryption Mode Moni Naor ∗ Omer Reingold

          Add to Reading List

          Source URL: omereingold.files.wordpress.com

          Language: English - Date: 2014-10-21 15:08:35
            26From Unpredictability to Indistinguishability: A Simple Construction of Pseudo-Random Functions from MACs Preliminary Version Moni Naor 

            From Unpredictability to Indistinguishability: A Simple Construction of Pseudo-Random Functions from MACs Preliminary Version Moni Naor 

            Add to Reading List

            Source URL: omereingold.files.wordpress.com

            Language: English - Date: 2014-10-21 18:24:39
              27History-Independent Cuckoo Hashing Moni Naor∗‡ Gil Segev†‡  Udi Wieder§

              History-Independent Cuckoo Hashing Moni Naor∗‡ Gil Segev†‡ Udi Wieder§

              Add to Reading List

              Source URL: pholia.tdi.informatik.uni-frankfurt.de

              Language: English - Date: 2016-02-23 03:12:01
                28How Efficient can Memory Checking be? Cynthia Dwork∗ Moni Naor†  Guy N. Rothblum‡

                How Efficient can Memory Checking be? Cynthia Dwork∗ Moni Naor† Guy N. Rothblum‡

                Add to Reading List

                Source URL: www.wisdom.weizmann.ac.il

                - Date: 2008-12-28 07:24:27
                  29Fast Interactive Coding Against Adversarial Noise∗ Zvika Brakerski† Yael Tauman Kalai‡  Moni Naor§

                  Fast Interactive Coding Against Adversarial Noise∗ Zvika Brakerski† Yael Tauman Kalai‡ Moni Naor§

                  Add to Reading List

                  Source URL: www.wisdom.weizmann.ac.il

                  - Date: 2014-08-07 15:07:19
                    30Randomized Algorithms 2013A – Final Exam Robert Krauthgamer and Moni Naor February 17, 2013 General instructions. The exam has 2 parts. You have 3 hours. No books, notes, cell phones, or other external materials are al

                    Randomized Algorithms 2013A – Final Exam Robert Krauthgamer and Moni Naor February 17, 2013 General instructions. The exam has 2 parts. You have 3 hours. No books, notes, cell phones, or other external materials are al

                    Add to Reading List

                    Source URL: www.wisdom.weizmann.ac.il

                    - Date: 2014-11-12 02:00:51